package com.xiaotao.learn.algorithm.search;

public class TwoArrMid {
    public static void main(String[] args) {
        int[] arr1 = new int[]{1,2,3,4,5,6,7};
        int[] arr2 = new int[]{2,3,4,5,6,7};
//        System.out.println(getMid(arr1, arr2));
    }

    public static void getMid(int[] arr1, int[] arr2) {

        int len = arr1.length + arr2.length;
        int[] cur = arr1[0] < arr2[0] ? arr1 : arr2;
        int l = 0, l1 = 0, l2 = 0;
        for (int i = 0; i < len; i++) {
            System.out.print(cur[l] + " ");
            if(cur == arr1 ) {

            }
        }
    }
}
